A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation
نویسندگان
چکیده
y Abstract. Recently, a technique was presented for using pre-interpretations for abstract interpretation of the correct answer set CP of a logic program P. So far it was an open problem whether pre-interpretations could also be used for deriving non-downward closed properties of the computed answer set OP such as deenite freeness. This paper shows that it is possible to do so.
منابع مشابه
An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs
Static global analyses based on abstract interpretation have been used to derive properties of programs. The analyses differ in the expressiveness of the abstract domains and the precision and efficiency of domain operations. We extend an abstract domain defined by Jacobs and Langen and present new abstract domain operations to derive freeness, groundness, and sharing of variables in logic prog...
متن کاملNon-strict independence-based program parallelization using sharing and freeness information
The current ubiquity of multi-core processors has brought renewed interest in program parallelization. Logic programs allow studying the parallelization of programs with complex, dynamic data structures with (declarative) pointers in a comparatively simple semantic setting. In this context, automatic parallelizers which exploit and-parallelism rely on notions of independence in order to ensure ...
متن کاملShare Free Revisited
Analyses for possible variable sharing and de nite freeness are important both in the automatic parallelisation and in the optimisation of sequential logic programs In this paper a new e cient approach to analysis is described which can infer sharing and freeness information to an unusually high degree of accuracy The analysis exploits a con uence property of the uni cation algorithm to split t...
متن کاملFreeness Analysis in the Presence of Numerical Constraints
This paper describes a novel application of abstract interpretation dealing with mixed systems of numerical and unification constraints. In general, the abstraction of such systems cannot be separated into two independent parts, since a program variable is often involved in both types of constraints. The proposed abstraction deals in an elegant way with the interaction between the two types of ...
متن کاملA tool to check operational properties of Prolog programs with application to program construction and program optimization – Tool demonstration
We present a tool, based on abstract interpretation, that checks the correctness of an annotated Prolog program with respect to formal specifications of its procedures. Specifications describe operational properties such as mode, type, sharing, linearity, and size of input/output terms, occur-check freeness, conditions for sure success and failure, number of solutions to a call, including deter...
متن کامل